relative primality

См. также в других словарях:

• Quadratic reciprocity — The law of quadratic reciprocity is a theorem from modular arithmetic, a branch of number theory, which shows a remarkable relationship between the solvability of certain quadratic equations modulo different prime moduli.Although it allows us to… …   Wikipedia

• Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics       Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity.       Computer scientist Manindra Agrawal of the… …   Universalium

• Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… …   Wikipedia

• List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

• Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

• Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics …   Wikipedia

• Safe prime — A safe prime is a prime number of the form 2 p + 1, where p is also a prime. (Conversely, the prime p is a Sophie Germain prime.) The first few safe primes are5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563,… …   Wikipedia

• General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of …   Wikipedia

• Robert M. Solovay — Robert Martin Solovay (1938 ndash; ) is a set theorist who spent many years as a professor at UC Berkeley. Among his most noted accomplishments are showing (relative to the existence of an inaccessible cardinal) that the statement every set of… …   Wikipedia

• List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium